Buffer Occupancy of Statistical Mdtiplexers with Periodic Interchangeable Traffic in ATM Networks
نویسنده
چکیده
In this paper we analyze the buffer occupancy in a statistical multiplexer in ATM networks for a special t y p e of traffic, namely, periodic interchangeable (PI) traffic. Certain generalized Ballot theorem is applied to analyze the problem. Explicit formulas for the expected buffer occupancy are derived.
منابع مشابه
M1, M2, ..., Mk/G1, G2,..., Gk/l/N Queue with Buffer Division and Push-Out Schemes for ATM Networks (RESEARCH NOTE)
In this paper, loss probabilities and steady state probabilities of data packets for an asynchronous transfer mode (ATM) network are investigated under the buffer division and push-out schemes. Data packets are classified in classes k which arrive in Poisson fashion to the service facility and are served with general service rate under buffer division scheme, finite buffer space N is divided in...
متن کاملA Comparison of Two Buffer Occupancy Control Algorithms in ATM Networks
Current research treats the ATM paradigm as a generalization of multitude of concepts in the telecommunication area. On the other hand, fuzzy logic concepts are being applied in various engineering areas. This paper describes an application of fuzzy logic inference engine to buffer occupancy control in ATM networks. A model of statistical multiplexers of video sources for ATM networks is presen...
متن کاملDynamic bandwidth allocation scheme for multiple real-time VBR videos over ATM networks
This paper considers VBR transmission of multiple real-time videos over ATM networks. Multiple real-time VBR video sources are multiplexed into an ATM switch to transmit cells into the network. Given the ATM switch capacity, the problem is to dynamically allocate the required channel bandwidth for each video source such that the encoder buffer occupancy is maintained at a target level. To solve...
متن کاملSource Time Scale and Optimal Buffer/Bandwidth Trade-Off for Regulated Traffic in an ATM Node
In this paper, we study the problem of resource allocation and control for an ATM node with regulated traffic. Both guaranteed lossless service and statistical service with small loss probability are considered. We investigate the relationship between source characteristics and the buffer/bandwidth trade-off under both services. Our contributions are the following. For guaranteed lossless servi...
متن کاملQueueing Delays in Rate Controlled ATM Networks
This paper addresses the problem of finding the worst case end-to-end delay and buffer occupancy bounds in ATM networks with rate-controlled, non-work conserving servers. A theoretical framework is constructed to analyze such servers in isolation and in tandem. The analysis is based on a simple fluid model, but care is taken so that the computed delay and buffer occupancy values are upper bound...
متن کامل